Collapsible biclaw-free graphs
نویسندگان
چکیده
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with δ(G) ≥ 5, then G is collapsible, and of course supereulerian. This bound is best possible.
منابع مشابه
Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117]
If G is a 2-connected bipartite biclaw-free graph with (G) 4, then by [2, Lemma 2.2], every edge of G lies in a 4-cycle, and then by Lemma 2.5 (the correct version), G is collapsible. It follows that G will have a spanning eulerian subgraph. Note that a Hamiltonian cycle of G is a spanning eulerian subgraph of G with maximum degree 2. We consider it one possible way to attack Conjecture 1.1 of ...
متن کاملStrictness of the Collapsible Pushdown Hierarchy
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author’s pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples that separate the levels of the collapsible pushdown graph hierarchy and of the collapsible pushdown tree hierarchy, i.e., the hierarchy of trees generated by ...
متن کاملCollapsible graphs and Hamiltonian connectedness of line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics— an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, World Scientific, Singapore/London, 1995, pp. 53–69, Conjecture 8.6] conjectured that every 3-edge connected, essentially 6-edge connected graph ...
متن کاملFirst-Order Model Checking on Generalisations of Pushdown Graphs
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following. First-order logic with reachability is uniformly decidable on nested pushdown trees. Considering first-order logic without reachability, we prove decidability i...
متن کاملA Pumping Lemma for Collapsible Pushdown Graphs of Level 2
We present a pumping lemma for the class of collapsible pushdown graphs of level 2. This pumping lemma even applies to the ε-contractions of level 2 collapsible pushdown graphs. Our pumping lemma also improves the bounds of Hayashi’s pumping lemma for indexed languages. 1998 ACM Subject Classification F.1.1 Models of Computation
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006